A System for Distributed Mechanisms: Design, Implementation and Applications

We describe here a structured system for distributed mechanism design appropriate for both Intranet and Internet applications. In our approach the players dynamically form a network in which they know neither their neighbours nor the size of the network and interact to jointly take decisions. The only assumption concerning the underlying communication layer is that for each pair of processes there is a path of neighbours connecting them. This allows us to deal with arbitrary network topologies. We also discuss the implementation of this system which consists of a sequence of layers. The lower layers deal with the operations that implement the basic primitives of distributed computing, namely low level communication and distributed termination, while the upper layers use these primitives to implement high level communication among players, including broadcasting and multicasting, and distributed decision making. This yields a highly flexible distributed system whose specific applications are realized as instances of its top layer. This design is implemented in Java. The system supports at various levels fault-tolerance and includes a provision for distributed policing the purpose of which is to exclude `dishonest' players. Also, it can be used for repeated creation of dynamically formed networks of players interested in a joint decision making implemented by means of a tax-based mechanism. We illustrate its flexibility by discussing a number of implemented examples.Comment: 36 pages; revised and expanded versio

A Distributed Platform for Mechanism Design

We describe a structured system for distributed mechanism design. It consists of a sequence of layers. The lower layers deal with the operations relevant for distributed computing only, while the upper layers are concerned only with communication among players, including broadcasting and multicasting, and distributed decision making. This yields a highly flexible distributed system whose specific applications are realized as instances of its top layer. This design supports fault-tolerance, prevents manipulations and makes it possible to implement distributed policing. The system is implemented in Java. We illustrate it by discussing a number of implemented examples.Comment: 6 pages. To appear in the Proc. of International Conference on Computational Intelligence for Modelling, Control and Automation, IEEE Societ

Bidding Strategies in Agent-based Continuous Double Auctions

Online auctions are a platform to trade goods on the Internet. In this context, negotiation capabilities for software agents in continuous double auctions (CDAs) are a central concern. Agents need to be able to prepare bids for and evaluate offers on behalf of the users they represent with the aim of obtaining the maximum benefit for their users. For the agents, their bids are decided according to some bidding strategy. However, in CDAs, it is a complex decision problem because of the inherent uncertainty and dynamics of the auction market. In this book, we present a new bidding strategy for agents to adopt in CDAs and propose tools to enhance the performance of existing bidding strategies in CDAs. The superior performance of the new bidding strategy as well as the tools presented in this book are illustrated through extensive experiments

Bidding Strategies in Agent-based Continuous Double Auctions

Online auctions are a platform to trade goods on the Internet. In this context, negotiation capabilities for software agents in continuous double auctions (CDAs) are a central concern. Agents need to be able to prepare bids for and evaluate offers on behalf of the users they represent with the aim of obtaining the maximum benefit for their users. For the agents, their bids are decided according to some bidding strategy. However, in CDAs, it is a complex decision problem because of the inherent uncertainty and dynamics of the auction market. In this book, we present a new bidding strategy for agents to adopt in CDAs and propose tools to enhance the performance of existing bidding strategies in CDAs. The superior performance of the new bidding strategy as well as the tools presented in this book are illustrated through extensive experiments